int fib(int n) {
    if (n == 1 || n == 2)
        return 1;

    int a = 1, b = 1, result = 0;
    for (int i = 3; i <= n; i++) {
        result = a + b;
        a = b;
        b = result;
    }
    return result;
}
